Eigenvalues and degree deviation in graphs
نویسندگان
چکیده
منابع مشابه
Eigenvalues and degree deviation in graphs
Our notation is standard (e.g., see [3], [5], and [10]); in particular, all graphs are defined on the vertex set {1, 2, ..., n} = [n] and G (n,m) stands for a graph with n vertices and m edges. We write Γ (u) for the set of neighbors of the vertex u and set d (u) = |Γ (u)| . Given a graph G of order n, we assume that the eigenvalues of the adjacency matrix of G are ordered as μ (G) = μ1 (G) ≥ ....
متن کاملDeviation Inequalities on Largest Eigenvalues
In these notes, we survey developments on the asymptotic behavior of the largest eigenvalues of random matrix and random growth models, and describe the corresponding known non-asymptotic exponential bounds. We then discuss some elementary and accessible tools from measure concentration and functional analysis to reach some of these quantitative inequalities at the correct small deviation rate ...
متن کاملBounds on the Largest of Minimum Degree Eigenvalues of Graphs
Let G be a simple graph and let its vertex set be V (G) = {v1, v2, ..., vn}. The adjacency matrix A(G) of the graph G is a square matrix of order n whose (i, j)-entry is equal to unity if the vertices vi and vj are adjacent, and is equal to zero otherwise. The eigenvalues λ1, λ2, ..., λn of A(G), assumed in non increasing order, are the eigenvalues of the graph G. The energy of G was first defi...
متن کاملOn the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
متن کاملEigenvalues, Multiplicities and Graphs
For a given graph, there is a natural question of the possible lists of multiplicities for the eigenvalues among the spectra of Hermitian matrices with that graph (no constraint is placed upon the diagonal entries of the matrices by the graph). Here, we survey some of what is known about this question and include some new information about it. There is a natural focus upon the case in which the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Linear Algebra and its Applications
سال: 2006
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.10.011